Reducing Memory References for FFT Calculation
نویسندگان
چکیده
Fast Fourier Transform (FFT) is one of the most widely used algorithms in digital signal processing. It is used in many signal processing and communication applications. many of the FFT operations are performed in embedded systems. Since Embedded systems is very small processors used in almost all type of appliances from microwave ovens to cars, and many embedded systems are portable and depend on small batteries for power; low energy design is extremely important in embedded systems design. One of the major energy consumption sources in any processor is memory access. Memory access requires more energy than almost any operation in a DSP (Digital Signal Processor), or embedded processor, reducing memory access plays a very important role in reducing energy consumption. In this paper we concentrate on the energy consumption in memory in calculating FFT. we compare between three different techniques in calculating FFT with reference to energy consumption in memory access. We also investigate the effect of the number of registers in the CPU on reducing energy consumption in memory access .
منابع مشابه
Efficient Methods for FFT calculations Using Memory Reduction Techniques
FFT algorithms is one of the many methods used for the calculation of DFT, but they are preferred due to their increased speed and higher efficiency, which arises due to the fact that for the calculation of a N-point DFT, the sequence is broken into several segments and the DFT for each segment is calculated. However, for this many redundant memory spaces are required. The Butterfly structure f...
متن کاملAn efficient memory-based FFT architecture
This paper proposes an efficient memory-based radix-2 FFT architecture, which greatly improves the memorybased FFT [5], [6] by reducing 50% memory size requirement, while maintaining a simple address generator. Specifically the memory size is reduced to 1.25N words. In addition, the multiplier utilization rate is 100%.
متن کاملReduced Logic and Low-Power FFT Architectures for Embedded Systems
Discrete Fourier Transform (DFT) is one of the core operations in digital signal processing and communication systems. Many fundamental algorithms can be realized by DFT, such as convolution, spectrum estimation, and correlation. Furthermore, DFT is widely used in standard embedded system applications such as wireless communication protocols requiring Orthogonal Frequency Division Multiplexing ...
متن کاملHigh throughput energy efficient multi - FFT architecture on FPGAs ( Draft ) ∗
To process high-rate streaming data, throughput is one of the key performance metrics for FFT design. However, high throughput FFT architectures consume large amount of power due to complex routing or excessive memory access. In this paper, we propose a Cooley-Turkey algorithm based, high throughput energy-efficient multi-FFT architecture. In the proposed architecture, we use multiple time-mult...
متن کامل-dimensional Parallel Fft Benchmark on Suprenum
A distributed memory vectorised 1-dimensional FFT benchmark is rst presented. The performance results of this benchmark on SUPRENUM are given and discussed. A performance analysis of the distributed memory FFT benchmark is performed and Hockney's performance parameters (r1 and n 1=2) are then employed to derive the performance formula. This formula is shown to t the experimental results very we...
متن کامل